Learning Association Rules and Tracking the Changing Concepts on Webpages: An Effective Pornographic Websites Filtering Approach

We applied the decision tree algorithm to learn association rules between webpage’s category (pornographic or normal) and the critical features. Based on these rules, we proposed an efficient method of filtering pornographic webpages with the following major advantages: 1) a weighted window-based technique was proposed to estimate for the condition of concept drift for the keywords found recently in pornographic webpages; 2) checking only contexts of webpages without scanning pictures; 3) an incremental learning mechanism was designed to incrementally update the pornographic keyword database.     

基于自适应阈值活动语音检测和最小均方误差对数谱幅度估计的低信噪比降噪算法

针对低信噪比(SNR)环境下传统方法对声信号降噪的局限性，提出了一种联合自适应阈值活动语音检测（VAD）算法和最小均方误差对数谱幅度估计（MMSE-LSA）的实时降噪算法。首先，在VAD算法中通过基于能量概率最大值的概率统计来对背景噪声进行估计，对得到的背景噪声进行实时更新并保存；然后，将实时更新的背景噪声作为MMSE-LSA的参考噪声，并对噪声幅度谱进行自适应更新，最后进行降噪处理。通过在真实场景中对四类声信号进行实验，结果表明，该算法在保证对低SNR声信号的实时处理的情况下，相较于传统MMSE-LSA算法，降噪信号的SNR能够提高10~15 dB，且不存在信号过减的情况，可应用于实际工程。     

Hybrid self-inertia weight adaptive particle swarm optimisation with local search using C4.5 decision tree classifier for feature selection problems

ABSTRACT

Feature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets.     

Event-triggered decentralized adaptive fault-tolerant control of uncertain interconnected nonlinear systems with actuator failures

This paper investigates the event-triggered decentralized adaptive tracking problem of a class of uncertain interconnected nonlinear systems with unexpected actuator failures. It is assumed that local control signals are transmitted to local actuators with time-varying faults whenever predefined conditions for triggering events are satisfied. Compared with the existing control-input-based event-triggering strategy for adaptive control of uncertain nonlinear systems, the aim of this paper is to propose a tracking-error-based event-triggering strategy in the decentralized adaptive fault-tolerant tracking framework. The proposed approach can relax drastic changes in control inputs caused by actuator faults in the existing triggering strategy. The stability of the proposed event-triggering control system is analyzed in the Lyapunov sense. Finally, simulation comparisons of the proposed and existing approaches are provided to show the effectiveness of the proposed theoretical result in the presence of actuator faults.     

Large neighborhood search for the bike request scheduling problem

This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.     

Learning bipartite Bayesian networks under monotonicity restrictions

ABSTRACT

Learning parameters of a probabilistic model is a necessary step in machine learning tasks. We present a method to improve learning from small datasets by using monotonicity conditions. Monotonicity simplifies the learning and it is often required by users. We present an algorithm for Bayesian Networks parameter learning. The algorithm and monotonicity conditions are described, and it is shown that with the monotonicity conditions we can better fit underlying data. Our algorithm is tested on artificial and empiric datasets. We use different methods satisfying monotonicity conditions: the proposed gradient descent, isotonic regression EM, and non-linear optimization. We also provide results of unrestricted EM and gradient descent methods. Learned models are compared with respect to their ability to fit data in terms of log-likelihood and their fit of parameters of the generating model. Our proposed method outperforms other methods for small sets, and provides better or comparable results for larger sets.     

New version of continuous–discrete cubature Kalman filtering for nonlinear continuous–discrete systems

For nonlinear continuous–discrete systems, this paper elaborates a new accurate implementation of continuous–discrete cubature Kalman filter (CD-CKF). As the main contribution of this work, the new Kalman prediction stage begins by integrating the nonlinear continuous model for all the cubature sample vectors; the prior estimate state and covariance prediction are based on the weighted statistics of these integrated cubature sample vectors and the Gauss–Legendre approximation scheme. The new square root form CD-CKF is also derived and accurately implemented by combining with the modified variable stepsize NIRK. As the advantages of proposed approach, the complicated and error-prone processes of solving covariance differential equation or calculating derivatives are avoided, while the positive semi-definiteness of prior error covariance are numerically guaranteed. Simulations of traffic control scenarios further confirm the new approach’s superior filtering performance in both reliability and accuracy.     

基于变异算子和邻域值自适应的MOEA/D算法

基于分解的多目标进化算法（MOEA/D）在解决多目标问题时，具有简单有效的特点。但多数MOEA/D采用固定的控制参数，导致全局搜索能力差，难以平衡收敛性和多样性。针对以上问题提出一种基于变异算子和邻域值自适应的多目标优化算法。该算法根据种群中个体适应度值的分散或集中程度进行判断，并据此对变异算子进行自适应的调节，从而增强算法的全局搜索能力；根据进化所处的阶段以及个体适应度值的集中程度，自适应地调节邻域值大小，保证每个个体在不同的进化代数都有一个邻域值大小；在子问题邻域中，统计子问题对应个体的被支配数，通过判断被支配数是否超过设定的上限，来决定是否将Pareto支配关系也作为邻域内判断个体好坏的准则之一。将提出的算法与传统的MOEA/D在标准测试问题上进行对比。实验结果表明，提出的算法求得的解集具有更好的收敛性和多样性，在求解性能上具有一定的优势。     

车辆自组织网络中新型NP-CSMA随机多址协议研究分析

智能交通的出现使得车辆自组织网络受到越来越多的关注。车辆自组织网络的动态拓扑结构变化非常剧烈,这对网络的吞吐率、传输速率等性能提出了很高的要求。提出1种具有握手机制协议的自适应多通道双时钟NP-CSMA随机多址接入协议。该协议首先区分2种P-CSMA协议,握手机制成功解决了隐藏的终端问题,双时钟机制减少了平均空闲时间,多通道机制增加通道数量和划分用户优先级的同时提高了系统吞吐率,自适应机制能够使系统在高负载下保持稳定吞吐率。还对该协议的传输速率进行了分析,得出该协议的传输速率相对较高的结论。通过平均周期方法推导吞吐率和传输速率的计算公式,仿真结果与理论推导一致。